نتایج جستجو برای: maximal N-prime of (0)
تعداد نتایج: 21396174 فیلتر نتایج به سال:
The rings considered in this article are commutative with identity $1neq 0$. By a proper ideal of a ring $R$, we mean an ideal $I$ of $R$ such that $Ineq R$. We say that a proper ideal $I$ of a ring $R$ is a maximal non-prime ideal if $I$ is not a prime ideal of $R$ but any proper ideal $A$ of $R$ with $ Isubseteq A$ and $Ineq A$ is a prime ideal. That is, among all the proper ideals of $R$,...
given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...
the rings considered in this article are commutative with identity $1neq 0$. by a proper ideal of a ring $r$, we mean an ideal $i$ of $r$ such that $ineq r$. we say that a proper ideal $i$ of a ring $r$ is a maximal non-prime ideal if $i$ is not a prime ideal of $r$ but any proper ideal $a$ of $r$ with $ isubseteq a$ and $ineq a$ is a prime ideal. that is, among all the proper ideals of $r$,...
the rings considered in this article are commutative with identity which admit at least two nonzero annihilating ideals. let $r$ be a ring. let $mathbb{a}(r)$ denote the set of all annihilating ideals of $r$ and let $mathbb{a}(r)^{*} = mathbb{a}(r)backslash {(0)}$. the annihilating-ideal graph of $r$, denoted by $mathbb{ag}(r)$ is an undirected simple graph whose vertex set is $mathbb{a}(r)...
If R is a valuation domain of maximal ideal P with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals P = L0 ⊃ L1 ⊃ · · · ⊃ Lm ⊇ 0 such that RLj /Lj+1 is almost maximal for each j, 0 ≤ j ≤ m − 1 and RLm is maximal if Lm 6= 0. Then we suppose that there is an integer n ≥ 1 such that each torsion-free R-module of finite rank is a direct s...
in this paper we classify fuzzy subgroups of a rank-3 abelian group $g = mathbb{z}_{p^n} + mathbb{z}_p + mathbb{z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. we present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
In this paper, we attempt to investigate the connection between various types of ideals (for examples $(m, n)$-ideal, bi-ideal, interior ideal, quasi ideal, prime ideal and maximal ideal) of an ordered semigroup $(S,cdot ,leq)$ and the correspond hyperideals of its EL-hyperstructure $(S,*)$ (if exists). Moreover, we construct the class of EL-$Gamma$-semihypergroup associated to a partially orde...
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید